The Connection Between the Adjacency Matrix and the Boundary Code of Benzenoid Hydrocarbons
نویسندگان
چکیده
In this work we wish to report a method for computing the adjacency matrix of benzenoid hydrocarbons from their boundary codes. The carbon skeletons of benzenoids will be depicted by graphs, called benzenoid graphs• , which can be constructed in the plane by assembhng h regular hexagons in such a way that two hexagons have exactly one joint edge or are disjoint, and the covered area in the plane is simply connected3•4• This restriction excludes benzenoid hydrocarbons with a »hole« in the interior, e. g. corannulenes. Since benzenoid graphs represent networks of hexagons5•6, it is also customary to call them, for brevity, polyhexes7• Another name used for these structures is arenes8• In the present report we will use the term polyhex for a benzenoid hydrocarbon.
منابع مشابه
How to Find the Fries Structures for Benzenoid Hydrocarbons
An efficient algorithm leading to the Fries canonical structure is presented for benzenoid hydrocarbons. This is a purely topological approach, which is based on adjacency matrices and the Hadamard procedure of matrix multiplication. The idea is presented for naphthalene, as an example. The Fries canonical-structures are also derived for anthracene, coronene, triphenylene, phenanthrene, benz[a]...
متن کاملSpectral Moments of the Edge Adjacency Matrix in Molecular Graphs. Benzenoid Hydrocarbons
The spectral moments of the edge adjacency matrix recently have been successfully employed in quantitative structure-property relationship (QSPR) and quantitative structure-activity relationship (QSAR) studies of alkanes, alkyl halides, benzyl alcohols, and cycloalkanes.1-3 In this work we examined spectral moments of the edge adjacency matrix of benzenoid hydrocarbons. We designed combinatoria...
متن کاملTHE RELATION BETWEEN TOPOLOGICAL ORDERING AND ADJACENCY MATRIX IN DIGRAPHS
In this paper the properties of node-node adjacency matrix in acyclic digraphs are considered. It is shown that topological ordering and node-node adjacency matrix are closely related. In fact, first the one to one correspondence between upper triangularity of node-node adjacency matrix and existence of directed cycles in digraphs is proved and then with this correspondence other properties of ...
متن کاملOn discriminativity of vertex-degree-based indices
A recently published paper [T. Došlić, this journal 3 (2012) 25-34] considers the Zagreb indices of benzenoid systems, and points out their low discriminativity. We show that analogous results hold for a variety of vertex-degree-based molecular structure descriptors that are being studied in contemporary mathematical chemistry. We also show that these results are straightforwardly obtained by u...
متن کاملAltan derivatives of a graph
Altan derivatives of polycyclic conjugated hydrocarbons were recently introduced and studied in theoretical organic chemistry. We now provide a generalization of the altan concept, applicable to any graph. Several earlier noticed topological properties of altan derivatives of polycyclic conjugated hydrocarbons are shown to be the properties of all altan derivatives of all graphs. Among these ar...
متن کامل